KERALA UNIVERSITY Class 3 data structures and algorithms Question Paper 2020

Practice authentic previous year questions for better exam preparation.

Sample Questions

Differentiate between abstract and concrete data structure.
What is stepwise refinement?
Let LIST be the singly linked list. Write an algorithm to find the number of times a given data item ITEM occurs in the LIST.
Check whether the given expression is properly parenthesized using stack $$ \left(A+\left[\frac{(B * C)}{D-E}\right]-F\right) $$
Explain structured approach to programming